Computing Least Common Subsumers in Expressive Description Logics
نویسنده
چکیده
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service can be used for the approximation of concept disjunctions in description logics, the \bottom-up" construction of knowledge bases, learning tasks, and for speciic kinds of information retrieval. So far, computing the least common subsumer has been restricted to description logics with rather limited expressivity. In this article , we continue recent research on extending this operation to more complex languages and present a least common subsumer operator for the expressive description logics ALENR and ALQ.
منابع مشابه
A Tableaux-based Method for Computing Least Common Subsumers for Expressive Description Logics
Least Common Subsumers (LCS) have been proposed in Description Logics (DL) to capture the commonalities between two or more concepts. Since its introduction in 1992, LCS have been successfully employed as a logical tool for a variety of applications, spanning from inductive learning, to bottom-up construction of knowledge bases, information retrieval, to name a few. The best known algorithm for...
متن کاملComputing Least Common Subsumers for FLE+
Transitive roles are important for adequate representation of knowledge in a range of applications. In this paper we present a first algorithm to compute least common subsumers in a description logic with transitive roles.
متن کاملComputing the Least Common
Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive Description Logics (DLs) whereas existing knowledge bases are written in very expressive DLs. In order to allow the user to re-use concepts defined in such terminologies and still support the definition of new concepts by computing the lcs, we extend the notion of the lcs of concept descriptions ...
متن کاملComputing Probabilistic Least Common Subsumers in Description Logics
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, it can, for instance, be used for similarity-based information retrieval where information retrieval is performed on the basis of the similarities of user-specified examples. In this article, we first show that, for crisp DLs, in certain cases...
متن کاملLeast Common Subsumers in Description Logics
Description logics are a popular formalism for knowledge representation and reasoning. This paper introduces a new operation for description logics: computing the \least common subsumer" of a pair of descriptions. This operation computes the largest set of commonalities between two descriptions. After arguing for the usefulness of this operation, we analyze it by relating computation of the lea...
متن کامل